Cooperative Answering through Controlled Query Relaxation

نویسنده

  • Terry Gaasterland
چکیده

AS KNOWLEDGE STORAGE SYStems grow in size and complexity, it becomes unreasonable to expect that users always know enough about the data and how the data are organized to construct accurate and useful queries. Even when a system has syntactic utilities for building queries, users continue to compose queries that contain misconceptions, are too general, or are bound to fail. Cooperative-answering strategies seek to detect such situations and collaborate automatically with users to find the information that the users are seeking. They provide users with additional information,1,2 intermediate answers,3 qualified answers,4 or alternative queries.5 One form of cooperative behavior involves providing associated information that is relevant to a query.6–9 Relaxation—generalizing a query to capture neighboring information—is a means to obtain possibly relevant information. A cooperative-answering system described here uses relaxation to identify automatically new queries that are related to the user’s original query. For large databases, many relaxations might be possible. Therefore, the system incorporates methods to control relaxation: user constraints restrict the relaxation, and heuristics order the relaxed queries. The methods extend to incorporate semantic information from electronic thesaurii. The system has been implemented as a prototype query constructor. These methods combine to form a declarative, domain-independent method that lets users tailor queries through the exploration of semantic relationships. The methods work in concert with the user to provide a queryanswering system that answers not just the user’s literal query, but the intended query.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CoBase: A Cooperative Database System

This chapter proposes the use of the type abstraction hierarchy (TAH) as a framework for deriving cooperative query answers (CQA). The TAH integrates abstraction with the subsumption (is-a) and composition (part-of) semantics found in the type hierarchy. This framework provides a multi-level object representation that is an important aspect of cooperative query answering. Patterns, which specif...

متن کامل

Cooperative XML ( CoXML ) Query Answering at INEX 03

The Extensible Markup Language (XML) is becoming the most popular format for information representation and data exchange. Much research has been investigated on providing flexible query facilities while aiming at efficient techniques to extract data from XML documents. However, most of them are focused on only the exact matching of query conditions. In this paper, we describe a cooperative XML...

متن کامل

Restricting Query Relaxation through User Constraints

This paper describes techniques to restrict and to heuristically control relaxation of deductive database queries. The process of query relaxation provides a user with a means to automatically identify new queries that are related to the user's original query. However, for large databases, many relaxations may be possible. The methods to control and restrict the relaxation process introduced in...

متن کامل

Cooperative Query Answering for Approximate Answers with Nearness Measure in Hierarchical Structure Information Systems

COOPERATIVE QUERY ANSWERING FOR APPROXIMATE ANSWERS WITH NEARNESS MEASURE IN HIERARCHICAL STRUCTURE INFORMATION SYSTEMS Thanit Puthpongsiriporn, Ph.D. University of Pittsburgh Cooperative query answering for approximate answers has been utilized in various problem domains. Many challenges in manufacturing information retrieval, such as: classifying parts into families in group technology implem...

متن کامل

An Integrated Query Relaxation Approach Adopting Data Abstraction and Fuzzy Relation

This paper proposes a cooperative query answering approach that relaxes query conditions to provide approximate answers by utilizing similarity relationships between data values. The proposed fuzzy abstraction hierarchy (FAH) represents a similarity relationship based on the integrated notion of data abstraction and fuzzy relations. Based on FAH, the authors develop query relaxation operators l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Expert

دوره 12  شماره 

صفحات  -

تاریخ انتشار 1997